Computational number theory

Results: 224



#Item
11KogWis 2016 Doctoral Symposium: Call for Participation The Doctoral Symposium at KogWis 2016 is a forum for Ph.D. students to discuss their objectives and recent work with a panel of experienced researchers working in th

KogWis 2016 Doctoral Symposium: Call for Participation The Doctoral Symposium at KogWis 2016 is a forum for Ph.D. students to discuss their objectives and recent work with a panel of experienced researchers working in th

Add to Reading List

Source URL: spatialintelligence.org

Language: English - Date: 2016-06-22 22:05:53
12International Journal of Computer Theory and Engineering CONTENTS Volume 5, Number 4, August 2013 A Voting-Based Combination System for Protein Cellular Localization Sites Prediction……………………..585 Hafida B

International Journal of Computer Theory and Engineering CONTENTS Volume 5, Number 4, August 2013 A Voting-Based Combination System for Protein Cellular Localization Sites Prediction……………………..585 Hafida B

Add to Reading List

Source URL: www.ijcte.org

Language: English - Date: 2015-02-14 06:15:58
13Project number ISTCGL Computational Geometric Learning  Random Pursuit in Hilbert Space

Project number ISTCGL Computational Geometric Learning Random Pursuit in Hilbert Space

Add to Reading List

Source URL: cgl.uni-jena.de

Language: English - Date: 2013-11-21 09:39:43
1451  Documenta Math. Linear Programming Stories

51 Documenta Math. Linear Programming Stories

Add to Reading List

Source URL: documenta.sagemath.org

Language: English - Date: 2012-07-25 10:24:41
15Appendix K: Bibliography [1] R. L. Wilder. Cultural Basis of Mathematics I, II, III http://www.gap-system.org/~history/Extras/Cultural_Basis_I.html http://www.gap-system.org/~history/Extras/Cultural_Basis_II.html http://

Appendix K: Bibliography [1] R. L. Wilder. Cultural Basis of Mathematics I, II, III http://www.gap-system.org/~history/Extras/Cultural_Basis_I.html http://www.gap-system.org/~history/Extras/Cultural_Basis_II.html http://

Add to Reading List

Source URL: www.wolframfoundation.org

Language: English - Date: 2015-12-15 12:07:17
16FACTORIZATION TECHNIQUES ELVIS NUNEZ AND CHRIS SHAW Abstract. The security of the RSA public key cryptosystem relies upon the computational difficulty of deriving the factors of a particular semiprime modulus. In this pa

FACTORIZATION TECHNIQUES ELVIS NUNEZ AND CHRIS SHAW Abstract. The security of the RSA public key cryptosystem relies upon the computational difficulty of deriving the factors of a particular semiprime modulus. In this pa

Add to Reading List

Source URL: davidlowryduda.com

Language: English - Date: 2016-05-25 03:59:31
17Analysis of BKZ Guillaume Hanrot, Xavier Pujol, Damien Stehl´e ENSL, LIP, CNRS, INRIA, Universit´ e de Lyon, UCBL  May 5, 2011

Analysis of BKZ Guillaume Hanrot, Xavier Pujol, Damien Stehl´e ENSL, LIP, CNRS, INRIA, Universit´ e de Lyon, UCBL May 5, 2011

Add to Reading List

Source URL: caramba.loria.fr

Language: English - Date: 2016-06-13 15:37:32
18Information Theory based Validation for Point-cloud Segmentation aided by Tensor Voting Ming Liu, Roland Siegwart Autonomous Systems Lab, ETH Zurich, Switzerland ,

Information Theory based Validation for Point-cloud Segmentation aided by Tensor Voting Ming Liu, Roland Siegwart Autonomous Systems Lab, ETH Zurich, Switzerland ,

Add to Reading List

Source URL: www.ee.ust.hk

Language: English - Date: 2013-12-08 20:12:54
19Journal of Computational Dynamics c 
American Institute of Mathematical Sciences Volume 2, Number 1, June 2015

Journal of Computational Dynamics c American Institute of Mathematical Sciences Volume 2, Number 1, June 2015

Add to Reading List

Source URL: georgehaller.com

Language: English - Date: 2015-09-01 09:54:05
20Approximating Fault-Tolerant Domination in General Graphs Klaus-Tycho Foerster∗ Abstract In this paper we study the NP-complete problem of finding small k-dominating sets in general graphs, which allow k − 1 nodes to

Approximating Fault-Tolerant Domination in General Graphs Klaus-Tycho Foerster∗ Abstract In this paper we study the NP-complete problem of finding small k-dominating sets in general graphs, which allow k − 1 nodes to

Add to Reading List

Source URL: www.tik.ee.ethz.ch

Language: English - Date: 2015-05-18 12:16:23